The Essentially Equational Theory of Horn Classes

نویسنده

  • Hans-E. Porst
چکیده

It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known [1]. Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes are in fact (equivalent to) quasivarieties. Mathematics Subject Classification (1991). Primary 03C07, Secondary 08C15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Horn logic and cartesian categories

A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the substitution rule has to be modi ed. It is developed here in its minimal form, with equality and conjunction, as partial Horn logic . Various kinds of logical theory are equivalent: partial Horn theories, quasi-equational ...

متن کامل

Uni cation in Extensions of Shallow Equational Theories

We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...

متن کامل

Uniication in Extensions of Shallow Equational Theories

We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...

متن کامل

Tree Automata with Equality Constraints Modulo Equational Theories

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalize...

متن کامل

F . Jacquemard , M . Rusinowitch and L . Vigneron Tree automata with equality constraints modulo equational theories Research Report LSV - 05 - 16 August 2005

This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Log. Q.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2000